#define _CRT_SECURE_NO_WARNINGS

#include "BinarySearchTree.h"

int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> t;

	for (auto e : a)
	{
		t.insertr(e);
	}

	cout << t.find(20) << endl;

	t.InOrder();

	t.eraser(3);

	t.InOrder();

	BSTree<int> t1 = t;

	t1.InOrder();

	//BSTree<int> t2;

	//t2 = t1;

	//t2.InOrder();
}